A better dominance relation and heuristics for Two-Machine No-Wait Flowshops with Maximum Lateness Performance Measure

In this paper, we consider a manufacturing system with two-machine no-wait flowshop scheduling problem where setup times are uncertain. The the performance measure of maximum lateness was addressed in literature (Computational and Applied Mathematics 37, 6774-6794) dominance relations were proposed. We establish new relation show that is, on average, about 90$ \% $ more efficient than existing ones. Moreover, since it is highly unlikely to find optimal solutions for problems reasonable size by utilizing there exist no heuristic problem, propose constructive heuristics solve real life problems. conduct extensive computational experiments evaluate proposed heuristics. Computational indicate worst at least 20$ better benchmark solution. Furthermore, they also best 130$ one. average CPU time significantly less second.